全文获取类型
收费全文 | 14997篇 |
免费 | 937篇 |
国内免费 | 689篇 |
专业分类
化学 | 2466篇 |
晶体学 | 25篇 |
力学 | 1025篇 |
综合类 | 198篇 |
数学 | 11006篇 |
物理学 | 1903篇 |
出版年
2023年 | 91篇 |
2022年 | 147篇 |
2021年 | 196篇 |
2020年 | 255篇 |
2019年 | 266篇 |
2018年 | 268篇 |
2017年 | 346篇 |
2016年 | 348篇 |
2015年 | 280篇 |
2014年 | 609篇 |
2013年 | 775篇 |
2012年 | 712篇 |
2011年 | 628篇 |
2010年 | 676篇 |
2009年 | 878篇 |
2008年 | 963篇 |
2007年 | 1023篇 |
2006年 | 787篇 |
2005年 | 708篇 |
2004年 | 524篇 |
2003年 | 539篇 |
2002年 | 632篇 |
2001年 | 488篇 |
2000年 | 454篇 |
1999年 | 385篇 |
1998年 | 386篇 |
1997年 | 298篇 |
1996年 | 349篇 |
1995年 | 328篇 |
1994年 | 239篇 |
1993年 | 249篇 |
1992年 | 217篇 |
1991年 | 196篇 |
1990年 | 142篇 |
1989年 | 109篇 |
1988年 | 130篇 |
1987年 | 94篇 |
1986年 | 117篇 |
1985年 | 152篇 |
1984年 | 108篇 |
1983年 | 42篇 |
1982年 | 84篇 |
1981年 | 79篇 |
1980年 | 56篇 |
1979年 | 51篇 |
1978年 | 66篇 |
1977年 | 52篇 |
1976年 | 36篇 |
1975年 | 16篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 205 毫秒
91.
Onofrio Mario Di Vincenzo Plamen Koshlukov Roberto La Scala 《Advances in Applied Mathematics》2006,37(4):541
In this paper we describe completely the involutions of the first kind of the algebra UTn(F) of n×n upper triangular matrices. Every such involution can be extended uniquely to an involution on the full matrix algebra. We describe the equivalence classes of involutions on the upper triangular matrices. There are two distinct classes for UTn(F) when n is even and a single class in the odd case.Furthermore we consider the algebra UT2(F) of the 2×2 upper triangular matrices over an infinite field F of characteristic different from 2. For every involution *, we describe the *-polynomial identities for this algebra. We exhibit bases of the corresponding ideals of identities with involution, and compute the Hilbert (or Poincaré) series and the codimension sequences of the respective relatively free algebras.Then we consider the *-polynomial identities for the algebra UT3(F) over a field of characteristic zero. We describe a finite generating set of the ideal of *-identities for this algebra. These generators are quite a few, and their degrees are relatively large. It seems to us that the problem of describing the *-identities for the algebra UTn(F) of the n×n upper triangular matrices may be much more complicated than in the case of ordinary polynomial identities. 相似文献
92.
We present integral-type Darboux transformation for the mKdV hierarchy and for the mKdV hierarchy withself-consistent sources. In contrast with the normal Darboux transformation, the integral-type Darboux transformationscan offer non-auto-Backlund transformation between two (2n 1)-th mKdV equations with self-consistent sources withdifferent degrees. This kind of Darboux transformation enables us to construct the N-soliton solution for the mKdVhierarchy with self-consistent sources. We also propose the formulas for the m times repeated integral-type Darbouxtransformations for both mKdV hierarchy and mKdV hierarchy with self-consistent sources. 相似文献
93.
L. T. Ashchepkov D. V. Davydov 《Computational Mathematics and Mathematical Physics》2006,46(11):1910-1917
Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered. 相似文献
94.
全生寅 《数学的实践与认识》2006,36(1):253-256
证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系. 相似文献
95.
Hadi Mohammadi Bidhandi 《Annals of Operations Research》2006,143(1):237-250
This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this
formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous
and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables,
and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach
based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared
by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared
by several numerical examples. Computational experience with these data shows the superiority of the new approach. 相似文献
96.
Ivan Kojadinovic 《4OR: A Quarterly Journal of Operations Research》2007,5(2):117-142
The application of multi-attribute utility theory based on the Choquet integral requires the prior identification of a capacity
if the utility scale is unipolar, or of a bi-capacity if the utility scale is bipolar. In order to implement a minimum distance
principle for capacity or bi-capacity approximation or identification, quadratic distances between capacities and bi-capacities
are studied. The proposed approach, consisting in solving a strictly convex quadratic program, has been implemented within
the GNU R kappalab package for capacity and nonadditive integral manipulation. Its application is illustrated on two examples.
相似文献
97.
Valentin Brimkov 《Discrete Applied Mathematics》2007,155(14):1812-1825
We consider the problem of computing the Lovász theta function for circulant graphs Cn,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3. 相似文献
98.
G.J. Zalmai Qing-hong Zhang 《应用数学学报(英文版)》2007,23(2):217-234
In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem. 相似文献
99.
Vicky Mak 《Operations Research Letters》2007,35(1):36-44
This paper, using the Unconstrained Shape Matrix Optimization Problem as a test bed, we investigate various aspects of variable aggregation and disaggregation for a class of integer programs that contains binary expansion. We present theoretical and numerical results, and propose an iterative algorithm for exact solutions. 相似文献
100.